Extremal graph theory - PDFSEARCH.IO - Document Search Engine

Extremal graph theory
Results: 47

#	Item
11	Rational exponents in extremal graph theory arXiv:1506.06406v1 [math.CO] 21 Jun 2015 Boris Bukh∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-06-22 20:31:37
12	B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem Add to Reading List Source URL: www.caam.rice.edu Language: English - Date: 2006-08-14 16:34:49 Graph theory NP-complete problems Clique Degeneracy Dominating set Independent set Graph Degree Graph coloring Extremal graph theory
13	On degree sequences forcing the square of a Hamilton cycle Katherine Staden (University of Birmingham) Many famous results in extremal graph theory give minimum degree conditions that force some substructure. For example Add to Reading List Source URL: web.mat.bham.ac.uk - Date: 2014-11-06 06:41:59
14	EXTREMAL GRAPH THEORY AND FACE NUMBERS OF FLAG TRIANGULATIONS OF MANIFOLDS (EXTENDED ABSTRACT) MICHAL ADAMASZEK Introduction. If G = (V, E) is an arbitrary simple, finite, undirected graph, we denote by Cl(G) the clique Add to Reading List Source URL: www.mimuw.edu.pl Language: English - Date: 2016-02-08 09:21:53
15	THE TYPICAL STRUCTURE OF SPARSE Kr+1 -FREE GRAPHS arXiv:1307.5967v1 [math.CO] 23 Jul 2013 ´ JOZSEF Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-07-23 20:20:52 Graph theory Graph coloring Random graph Triangle-free graph Extremal graph theory Interval edge coloring Line graph
16	BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-04-12 04:11:55 NP-complete problems Maximal independent set Independent set Graph coloring Clique Extremal graph theory Domatic number Path decomposition Graph theory Theoretical computer science Mathematics
17	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs W. T. Gowers Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results giv Add to Reading List Source URL: www.dpmms.cam.ac.uk Language: English - Date: 2005-03-14 06:41:35 Szemerédi regularity lemma Bipartite graph Extremal graph theory Graph Minor Line graph Graph theory Mathematics Hypergraph
18	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2009-08-09 08:17:46 Graph operations Clique Extremal graph theory Vertex cover Hypergraph Line graph Graph theory Theoretical computer science NP-complete problems
19	Extremal Parameters in Sub-Critical Graph Classes Michael Drmota∗ Marc Noy† August 2012 Add to Reading List Source URL: www.dmg.tuwien.ac.at Language: English - Date: 2012-08-31 04:06:36 Factorial Number theory Graph operations Path decomposition Block graph Graph theory Mathematics Combinatorics
20	Optim Lett:287–295 DOIs11590ORIGINAL PAPER A generalization of the Motzkin–Straus theorem to hypergraphs Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:22 Clique Extremal graph theory Hypergraph Degree Line graph Graph structure theorem Graph theory NP-complete problems Graph operations